TRAINING ON CLASS INCLUSION PROBLEMS
نویسندگان
چکیده
منابع مشابه
A Class of nonlinear $(A,eta)$-monotone operator inclusion problems with iterative algorithm and fixed point theory
A new class of nonlinear set-valued variationalinclusions involving $(A,eta)$-monotone mappings in a Banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(A,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.
متن کاملComparing inclusion techniques on chemical engineering problems
Solving general nonlinear systems of equations and/or finding the global optimum of nonconvex functions constitute an important part of the everyday practice in chemical engineering. Standard methods cannot provide theoretical guarantee for convergence to a solution, cannot find multiple solutions, and cannot prove non-existence of solutions. This is the main motive to apply interval methods. I...
متن کاملTree inclusion problems
Given two trees (a target T and a pattern P ) and a natural number w, window embedded subtree problems consist in deciding whether P occurs as an embedded subtree of T and/or finding the number of size (at most) w windows of T which contain pattern P as an embedded subtree. P is an embedded subtree of T if P can be obtained by deleting some nodes from T (if a node v is deleted, all edges adjace...
متن کاملOn Gauss's Class Number Problems
Let h be the class number of binary quadratic forms (in Gauss's formulation). All negative determinants having some h = On ± 1 can be determined constructively: for h = 5 there are four such determinants; for h = 7, six; for A = 11, four; and for h = 13, six. The distinction between class numbers for determinants and for discriminants is discussed and some data are given. The question of one cl...
متن کاملInclusion Problems in Trace Monoids
We suggest a number efficient pattern matching algorithms for dependence graphs of traces. A graph G = (V, E, λ) of partial order labeled by letters from alphabet Σ belongs to this class iff there exists a reflexive and symmetric relation D ⊂ Σ × Σ such that if v <G v′ and (λ(v).λ(v′)) ∈ D → (v, v′) ∈ E. We consider pattern matching problems related to problems of recognizing frequent patterns ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japanese Psychological Research
سال: 1972
ISSN: 0021-5368,1468-5884
DOI: 10.4992/psycholres1954.14.61